DIAMETER AND RADIUS OF THE WEIGHTED PREFRACTAL GRAPH BY A COMPLETE BIPARTITE SEED
نویسندگان
چکیده
منابع مشابه
The Steiner diameter of a graph
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $Ssubseteq V(G)$, the Steiner distance $d(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $...
متن کاملOn the spectral radius of bipartite graphs with given diameter
Article history: Received 17 March 2008 Accepted 9 October 2008 Available online 3 December 2008 Submitted by R.A. Brualdi AMS classification: 05C50
متن کاملOn Subgraphs of the Complete Bipartite Graph
G(n) denotes a graph of n vertices and G(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let C k (G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k 2 (n) (1) min C (G (n)) + Ck(G(n)) < k k, , ! 2 2 where the minimum is over all graphs G(n). It seems likely that (1)...
متن کاملa comparative move analysis of the introduction sections of ma theses by iranian and native post-graduate students
since esp received universal attention to smooth the path for academic studies and productions, a great deal of research and studies have been directed towards this area. swales’ (1990) model of ra introduction move analysis has served a pioneering role of guiding many relevant studies and has proven to be productive in terms of helpful guidelines that are the outcome of voluminous productions ...
15 صفحه اولMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Polythematic Online Scientific Journal of Kuban State Agrarian University
سال: 2017
ISSN: 1990-4665
DOI: 10.21515/1990-4665-134-033